Query Answering in Ontologies under Preference Rankings
نویسندگان
چکیده
We present an ontological framework, based on preference rankings, that allows users to express their preferences between the knowledge explicitly available in the ontology. Using this formalism, the answers for a given query to an ontology can be ranked by preference, allowing users to retrieve the most preferred answers only. We provide a host of complexity results for the main computational tasks in this framework, for the general case, and for EL and DL-Litecore as underlying ontology languages.
منابع مشابه
Top-k Query Answering in Datalog+/- Ontologies under Subjective Reports (Technical Report)
The use of preferences in query answering, both in traditional databases and in ontology-based data access, has recently received much attention, due to its many real-world applications. In this paper, we tackle the problem of top-k query answering in Datalog+/– ontologies subject to the querying user’s preferences and a collection of (subjective) reports of other users. Here, each report consi...
متن کاملQuery Rewriting for Horn-SHIQ Plus Rules
Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite a given query to an equivalent SQL or Datalog query over a database associated with the ontology. This approach has been intensively studied for conjunctive query answering in the DL-Lite and EL families, but is much less explored fo...
متن کاملOn the Complexity of Consistent Query Answering in the Presence of Simple Ontologies
Consistent query answering is a standard approach for producing meaningful query answers when data is inconsistent. Recent work on consistent query answering in the presence of ontologies has shown this problem to be intractable in data complexity even for ontologies expressed in lightweight description logics. In order to better understand the source of this intractability, we investigate the ...
متن کاملQuery Rewriting for Inconsistent DL-Lite Ontologies
In this paper we study the problem of obtaining meaningful answers to queries posed over inconsistent DL-Lite ontologies. We consider different variants of inconsistency-tolerant semantics and show that for some of such variants answering unions of conjunctive queries (UCQs) is first-order (FOL) rewritable, i.e., it can be reduced to standard evaluation of a FOL/SQL query over a database. Since...
متن کاملVariable-Strength Conditional Preferences for Ranking Objects in Ontologies
We introduce conditional preference bases as a means for ranking objects in ontologies. Conditional preference bases consist of a description ogic knowledge base and a finite set of conditional preferences, which are statements of the form “generally, in the context φ, property α is referred over property ¬α with strength s”. They are inspired by variable-strength defaults in conditional knowle...
متن کامل